Inference on Covariance Operators via Concentration Inequalities: k-sample Tests, Classification, and Clustering via Rademacher Complexities
نویسندگان
چکیده
منابع مشابه
Nonparametric K-Sample Tests via Dynamic Slicing
ISSN: 0162-1459 (Print) 1537-274X (Online) Journal homepage: http://www.tandfonline.com/loi/uasa20 Nonparametric K-Sample Tests via Dynamic Slicing Bo Jiang, Chao Ye & Jun S. Liu To cite this article: Bo Jiang, Chao Ye & Jun S. Liu (2015) Nonparametric K-Sample Tests via Dynamic Slicing, Journal of the American Statistical Association, 110:510, 642-653, DOI: 10.1080/01621459.2014.920257 To link...
متن کاملApproximate Inference via Weighted Rademacher Complexity
Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size of an arbitrary weighted set, defined as the sum of weights of all elements in the set. Our technique provides upper and lower bounds on a novel generalization of Rademacher com...
متن کاملDiscussion: Local Rademacher Complexities and Oracle Inequalities in Risk Minimization
In this magnificent paper, Professor Koltchinskii offers general and powerful performance bounds for empirical risk minimization, a fundamental principle of statistical learning theory. Since the elegant pioneering work of Vapnik and Chervonenkis in the early 1970s, various such bounds have been known that relate the performance of empirical risk minimizers to combinatorial and geometrical feat...
متن کاملstatistical inference via empirical bayes approach for stationary and dynamic contingency tables
چکیده ندارد.
15 صفحه اولLifted Inference via k-Locality
Lifted inference approaches exploit symmetries of a graphical model. So far, only the automorphism group of the graphical model has been proposed to formalize the symmetries used. We show that this is only the GIcomplete tip of a hierarchy and that the amount of lifting depends on how local the inference algorithm is: if the LP relaxation introduces constraints involving features over at most k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sankhya A
سال: 2018
ISSN: 0976-836X,0976-8378
DOI: 10.1007/s13171-018-0143-9